SCARF: A Biomedical Association Rule Finding Webserver

نویسندگان

  • Balázs Szalkai
  • Vince Grolmusz
چکیده

The analysis of enormous datasets with missing data entries is a standard task in biological and medical data processing. Large-scale, multi-institution clinical studies are the typical examples of such datasets. These sets make possible the search for multi-parametric relations since from the plenty of the data one is likely to find a satisfying number of subjects with the required parameter ensembles. Specifically, finding combinatorial biomarkers for some given condition also needs a very large dataset to analyze. For this goal, statistical regression analysis is not the preferred tool of choice, since (i) the a priori knowledge of the parameter-sets to analyze is missing, and (ii) typically relatively few subjects have the interesting parameter-value ensembles for the analysis. For fast and automatic multi-parametric relation discovery association-rule finding tools are used for more than two decades in the data-mining community. Here we present the SCARF webserver for generalized association rule mining. Association rules are of the form: a AND b AND ...AND x → y, meaning that the presence of properties a AND b AND ...AND x implies property y; our algorithm finds generalized association rules, since it also finds logical disjunctions (i.e., ORs) at the left-hand side, allowing the discovery of more complex rules in a more compressed form in the database. This feature also helps reducing the typically very large result-tables of such studies, since allowing ORs in the left-hand side of a single rule could include dozens of classical rules. The capabilities of the SCARF algorithm were demonstrated in mining the Alzheimer’s database of the Coalition Against Major Diseases (CAMD) in our recent publication (Archives of Gerontology and Geriatrics Vol. 73, pp. 300-307, 2017). Here we describe the webserver implementation of the algorithm. Availability and implementation: The stand-alone SCARF (Simple Combinatorial Association Rule Finder) program is written in C++, and is downloadable from https://pitgroup.org/apps/scarf/downloads/scarf.zip. The webserver can be found at the address https://pitgroup.org/scarf/. ∗Corresponding authors Email addresses: [email protected] (Balázs Szalkai), [email protected] (Vince Grolmusz)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scarf Oiks

We formulate the famous Scarf Lemma in terms of oiks. This lemma has two fundamental applications in game and graph theory. In 1967, Scarf derived from it core-solvability of balanced cooperative games. Recently, it was shown that kernelsolvability of perfect graphs also results from this lemma. We show that Scarf’s combinatorially defined oiks are in fact realized by polytopes, and that Scarf’...

متن کامل

Inferring characteristic phenotypes via class association rule mining in the bone dysplasia domain

Finding, capturing and describing characteristic features represents a key aspect in disorder definition, diagnosis and management. This process is particularly challenging in the case of rare disorders, due to the sparse nature of data and expertise. From a computational perspective, finding characteristic features is associated with some additional major challenges, such as formulating a comp...

متن کامل

Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining

The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...

متن کامل

Complexity of Scarf’s Lemma and Related Problems

Scarf’s lemma is one of the fundamental results in combinatorics, originally introduced to study the core of an N -person game. Over the last four decades, the usefulness of Scarf’s lemma has been demonstrated in several important combinatorial problems seeking stable solutions ([12], [1] [2], [15]). However, the complexity of the computational version of Scarf’s lemma (Scarf) remained open. In...

متن کامل

Mining hidden connections among biomedical concepts from disjoint biomedical literature sets through semantic-based association rule

The novel connection between Raynaud dise ase and fish oils was uncovered from two disjointed biomedical literature sets by Swanson in 1986. Since then, there have been many approaches to uncover novel connections by mining the biomedical literature. One of the popular approaches is to adapt the Association Rule (AR) method to automatically identify implicit novel connections between concept A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1709.09850  شماره 

صفحات  -

تاریخ انتشار 2017